Applying Propositional Logic to Workflow Verification

نویسندگان

  • Henry H. Bi
  • J. Leon Zhao
چکیده

The increasing complexity of business processes in the era of e-business has heightened the need for workflow verification tools. However, workflow verification remains an open and challenging research area. As an indication, most of commercial workflow management systems do not yet provide workflow designers with formal workflow verification tools. We propose a logic-based verification method that is based on a well-known formalism, i.e., propositional logic. Our logic-based workflow verification approach has distinct advantages such as its rigorous yet simplistic logical formalism and its ability to handle generic activity-based process models. In this paper, we present the theoretical framework for applying propositional logic to workflow verification and demonstrate that logic-based workflow verification is capable of detecting process anomalies in workflow models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Verifying the Termination of Workflows

In this paper we describe the behavior of workflows using graph theory and logic. A workflow is an abstraction of a business process that consists of one or more tasks to be executed to reach the goal or objective of the business process. Graphs are a formal notation that may be used for representing business processes. We use propositional logic to describe all possible models or cases present...

متن کامل

A system for deduction-based formal verification of workflow-oriented software models

The work concerns formal verification of workflow-oriented software models using the deductive approach. The formal correctness of a model’s behaviour is considered. Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. A system, along with its architect...

متن کامل

Compact Propositional Encoding of First-Order Theories

In this paper we present polynomial-time algorithms that translate First-Order Logic (FOL) theories to smaller propositional encodings than achievable before in polynomial time. For example, we can sometimes reduce the number of propositions to O(|P | + |C|), or O(|P | · log |P |), for |P | predicates of arity k and |C| constant symbols. The guarantee depends on availability of some graphical s...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Information Technology and Management

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2004